SOLVING THE MULTI-MANNED ASSEMBLY LINE BALANCING PROBLEM WITH DEPENDENT TASK TIMES BY MEANS OF EMPIRICALLY ADJUSTED GREEDY HEURISTICS (EAGH)
نویسندگان
چکیده
ABSTRACT: Multi-manned assembly lines are widely used in manufacturing industries that process a high-volume of large-sized workpieces. At each workstation there multiple workers simultaneously performing different tasks with the possibility interfering other, leading to an increase processing task times. This paper studies this type problem: multi-manned line balancing problem dependent times (MALBP-DTT). As discussed recent literature, HEUR_PART procedure presents best behaviour for solving MALBP-DTT. In paper, is improved by using Empirically Adjusted Greedy Heuristics (EAGH) along new (named “EAGH-CKTL”) presented and based on EAGH combined cocktail heuristics concept. EAGH-CKTL design priority rules MALBP-DTT through steps. particular, applied building have good performance as part heuristics. The computational experiments show efficiency both designing efficient rules: one designed better than any other rule proposed literature HEUR_PART, while another evidences remarkable improvement results when added its original Keywords: combinatorial optimisation; balancing; workstations; times; EAGH;
منابع مشابه
Assembly line balancing problem with skilled and unskilled workers: The advantages of considering multi-manned workstations
This paper address a special class of generalized assembly line balancing in which it is assumed that there are two groups of workers: skilled and unskilled ones. The skilled workers are hired permanently while the unskilled ones can be hired temporarily in order to meet the seasonal demands. It is also assumed that more than one worker may be assigned to each workstation. To show the adv...
متن کاملA cost-oriented model for multi-manned assembly line balancing problem
In many real world assembly line systems which the work-piece is of large size more than one worker work on the same work-piece in each station. This type of assembly line is called multi-manned assembly line (MAL). In the classical multi-manned assembly line balancing problem (MALBP) the objective is to minimize the manpower needed to manufacture one product unit. Apart from the manpower, othe...
متن کاملEmpirically Adjusted Greedy Algorithms (EAGH): A new approach to solving combinatorial optimisation problems
A greedy heuristic to solve a given combinatorial optimisation problem can be seen as an element of an infinite set of heuristics, H, which is defined by a function that depends on several parameters. We propose a procedure for determining the best element of H for a set of instances of the combinatorial optimisation problem. The procedure consists essentially in applying a direct non-linear op...
متن کاملa cost-oriented model for multi-manned assembly line balancing problem
in many real world assembly line systems which the work-piece is of large size more than one worker work on the same work-piece in each station. this type of assembly line is called multi-manned assembly line (mal). in the classical multi-manned assembly line balancing problem (malbp) the objective is to minimize the manpower needed to manufacture one product unit. apart from the manpower, othe...
متن کاملSolving a multi-objective mixed-model assembly line balancing and sequencing problem
This research addresses the mixed-model assembly line (MMAL) by considering various constraints. In MMALs, several types of products which their similarity is so high are made on an assembly line. As a consequence, it is possible to assemble and make several types of products simultaneously without spending any additional time. The proposed multi-objective model considers the balancing and sequ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Dyna management
سال: 2023
ISSN: ['2340-6585']
DOI: https://doi.org/10.6036/mn10905